AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملAn Optimal Distributed Bridge-Finding Algorithm
We model a computer network by a graph, where the vertices are computers and the edges are two-way communication links. It is a fundamental necessity that the graph be connected if the network is to operate as a whole. A bridge is an edge whose deletion causes the network to become disconnected. The bridges are the edges that are critical to network reliability. We give a simple, efficient dist...
متن کاملOn an Optimal Algorithm for Channel Assignment in Cellular Networks
A cellular network is often modelled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. In a recent paper [16], we introduced the notion of cellular graphs that models the hexagonal cell structure of a cellular network. Assuming a k-band buffering system where the interference does not extend beyond k cells away from the call originating cell, we pro...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAn Optimal Algorithm for Finding All Convex Subsets in Tournaments
A tournament is a complete directed graph. A convex subset is a vertex subset with the property that every two-path beginning and ending inside the convex subset is contained completely within the subset. This paper shows a relationship between convex subsets and transitive closures which leads to an optimal O(n 3)-time algorithm for nding all convex subsets in a tournament.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1976
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.19.32